منابع مشابه
Connectivity Oracles for Planar Graphs
We consider dynamic subgraph connectivity problems for planar undirected graphs. In this model there is a fixed underlying planar graph, where each edge and vertex is either “off” (failed) or “on” (recovered). We wish to answer connectivity queries with respect to the “on” subgraph. The model has two natural variants, one in which there are d edge/vertex failures that precede all connectivity q...
متن کاملExistence and continuous dependence for fractional neutral functional differential equations
In this paper, we investigate the existence, uniqueness and continuous dependence of solutions of fractional neutral functional differential equations with infinite delay and the Caputo fractional derivative order, by means of the Banach's contraction principle and the Schauder's fixed point theorem.
متن کاملConvergence of an Approach for Solving Fredholm Functional Integral Equations
In this work, we give a product Nyström method for solving a Fredholm functional integral equation (FIE) of the second kind. With this method solving FIE reduce to solving an algebraic system of equations. Then we use some theorems to prove the existence and uniqueness of the system. Finally we investigate the convergence of the method.
متن کاملDiameter bounds for planar graphs
The inverse degree of a graph is the sum of the reciprocals of the degrees of its vertices. We prove that in any connected planar graph, the diameter is at most 5/2 times the inverse degree, and that this ratio is tight. To develop a crucial surgery method, we begin by proving the simpler related upper bounds (4(|V | − 1) − |E|)/3 and 4|V |2/3|E| on the diameter (for connected planar graphs), w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physics Letters B
سال: 1981
ISSN: 0370-2693
DOI: 10.1016/0370-2693(81)90513-x